An adaptive prediction based approach for congestion estimation in active queue management (APACE)
نویسندگان
چکیده
Active Queue Management (AQM) policies are mechanisms for congestion avoidance, which pro-actively drop packets in order to provide an early congestion notification to the sources. In this paper we propose a new Adaptive Prediction based Approach for Congestion Estimation in Active Queue Management (APACE) that predicts the instantaneous queue length at a future time using adaptive filtering techniques. We compare the performance of APACE with other existing AQM schemes like RED [1], SRED [2], AVQ [3] and PAQM [4] in networks having both single and multiple bottleneck links. We show that the performance of APACE in terms of the stability of the instantaneous queue is comparable to that of PAQM, which is one of the best AQM strategies. Moreover APACE performs better than PAQM in terms of link utilization and in networks with multiple bottleneck links. APACE is not very sensitive to parameter settings, adapts quickly to changes in traffic and can achieve a given delay or packet loss by varying just one parameter, thus giving the network operator a better tool to manage congestion and improve the performance of the network.
منابع مشابه
An Adaptive Congestion Alleviating Protocol for Healthcare Applications in Wireless Body Sensor Networks: Learning Automata Approach
Wireless Body Sensor Networks (WBSNs) involve a convergence of biosensors, wireless communication and networks technologies. WBSN enables real-time healthcare services to users. Wireless sensors can be used to monitor patients’ physical conditions and transfer real time vital signs to the emergency center or individual doctors. Wireless networks are subject to more packet loss and congestion. T...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملDesign of H� Congestion Controller for TCP Networks Based on LMI Formulation
In this paper, a state feedback H¥ controller is proposed in order to design an active queue management (AQM) system based on congestion control algorithm for networks supporting TCP protocols. In this approach, the available link bandwidth is modeled as a time-variant disturbance. The purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...
متن کاملAn Improvement over Random Early Detection Algorithm: A Self-Tuning Approach
Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...
متن کامل